On Quantum Pushdown Automata
نویسنده
چکیده
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of quantum pushdown automata are not equivalent to the corresponding unitarity criteria of quantum Turing machines [BV 97]. Finally we present some simple languages recognized by quantum pushdown automata, two of them is not recognizable by deterministic pushdown automata and one seems to be not recognizable by probabilistic pushdown automata as well.
منابع مشابه
Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition
One important question for quantum computing is whether a computational gap exists between models that are allowed to use quantum effects and models that are not. Several types of quantum computation models have been proposed, including quantum finite automata and quantum pushdown automata (with a quantum pushdown stack). It has been shown that some quantum computation models are more powerful ...
متن کاملQuantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata (QPA) were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of QPA in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity c...
متن کاملQuantum Finite Automata: a Language Acceptor Model
There exist an computational gap between the models that allowed to use quantum effects and that are not using quantum effects. Quantum Finite Automata (QFA), Quantum Pushdown Automata (QPDA), Quantum branching are several computational models. Some computational models are more powerful than classical counterparts and some are not. In this survey work, we have drawn a comparison among 1-way QF...
متن کاملQuantum Pushdown Automata with a Garbage Tape
Several kinds of quantum pushdown automata have been proposed, and their computational power is investigated intensively. However, for some quantum pushdown automaton models, it is not known whether quantum models are at least as powerful as classical counterparts or not. This is due to the reversibility restriction. In this paper, we introduce a new quantum pushdown automaton model that has a ...
متن کاملA Theory of Computation Based on Quantum Logic
The (meta)logic underlying classical theory of computation is Boolean (twovalued) logic. Quantum logic was proposed by Birkhoff and von Neumann as a logic of quantum mechanics about 70 years ago. It is currently understood as a logic whose truth values are taken from an orthomodular lattice. The major difference between Boolean logic and quantum logic is that the latter does not enjoy distribut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1963